Extension of the maximum flow-covering location and service start time problem to allow flexible consumption
نویسندگان
چکیده
منابع مشابه
Maximum Flow-covering Location and Service Start Time Problem and Its Application to Tokyo Metropolitan Railway Network
This paper proposes the Maximum Flow-Covering Location and service Start Time Problem (MFCLSTP). The problem seeks to determine locations and service start time of p facilities which provide a service for a given duration, so as to maximally cover flows. Each flow is specified by a pair of origindestination (OD) nodes and the departure time of the origin node. We assume that a given commuter fl...
متن کاملDynamic Hub Covering Problem with Flexible Covering Radius
Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...
متن کاملLocations and Service Start Time of Flow-covering Facilities with Multiple Coverage Levels
This paper develops an extended version of MFCLSTP (Maximum Flow-Covering Location and service Start Time Problem, Tanaka 2011) by introducing multiple coverage levels based on the arrival time to a destination. The original MFCLSTP determines the locations of facilities and the start time of services of fixed duration to maximize coverage for flows on the way back home from work. In MFCLSTP, e...
متن کاملHub Covering Location Problem Considering Queuing and Capacity Constraints
In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...
متن کاملAN EXTENSION TO STOCHASTIC TIME-COST TRADE-OFF PROBLEM OPTIMIZATION WITH DISCOUNTED CASH FLOW
In this paper, an efficient multi-objective model is proposed to solve time-cost trade off problem considering cash flows. The proposed multi-objective meta-heuristic is based on Ant colony optimization and is called Non Dominated Archiving Ant Colony Optimization (NAACO). The significant feature of this work is consideration of uncertainties in time, cost and more importantly interest rate. A ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advanced Mechanical Design, Systems, and Manufacturing
سال: 2016
ISSN: 1881-3054
DOI: 10.1299/jamdsm.2016jamdsm0044